Engineering faster sorters for small sets of items
نویسندگان
چکیده
منابع مشابه
Small Maximal Independent Sets and Faster Exact Graph Coloring
We show that, for any n-vertex graph G and integer parameter k, there are at most 34k−n4n−3k maximal independent sets I ⊂ G with |I| ≤ k, and that all such sets can be listed in time O(34k−n4n−3k). These bounds are tight when n/4 ≤ k ≤ n/3. As a consequence, we show how to compute the exact chromatic number of a graph in time O((4/3 + 3/4)) ≈ 2.4150, improving a previous O((1 + 3)) ≈ 2.4422 alg...
متن کاملLogit Models for Sets of Ranked Items
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...
متن کاملApplications of Small Molecules in Muscle Tissue Engineering
Introduction: Skeletal muscles account for about 40% of the total body weight. Every year, hundreds of people lose at least part of their muscle tissue due to illness, war, and accidents. This can lead to disruption of activities such as breathing, movement, and social life. To this end, various therapeutic strategies such as medication therapy, cell therapy and tissue transplantation have been...
متن کاملMeasurement Scales for Scoring or Ranking Sets of Interrelated Items
Surveys concerned with human values, economic utilities, organisational features, customer or citizen satisfaction, or with preferences or choices among a set of items may aim at estimating either a ranking or a scoring of the choice set. In this paper we discuss the statistical and practical properties of five different techniques for data collection of a set of interrelated items; namely the ...
متن کاملFeature Selection for Small Sample Sets with High Dimensional Data Using Heuristic Hybrid Approach
Feature selection can significantly be decisive when analyzing high dimensional data, especially with a small number of samples. Feature extraction methods do not have decent performance in these conditions. With small sample sets and high dimensional data, exploring a large search space and learning from insufficient samples becomes extremely hard. As a result, neural networks and clustering a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Software: Practice and Experience
سال: 2020
ISSN: 0038-0644,1097-024X
DOI: 10.1002/spe.2922